Fast ranking algorithm for very large data

نویسنده

  • Dohy Hong
چکیده

In this paper, we propose a new ranking method inspired from previous results on the diffusion approach to solve linear equation. We describe new mathematical equations corresponding to this method and show through experimental results the potential computational gain. This ranking method is also compared to the well known PageRank model. Keywords-Large sparse matrix, Iteration, Fixed point, PageRank, Ranking.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Unsupervised Automobile Insurance Fraud Detection Based on Spectral Ranking of Anomalies

Collecting insurance fraud samples is costly and if performed manually is very time consuming. This issue suggests usage of unsupervised models. One of the accurate methods in this regards is Spectral Ranking of Anomalies (SRA) that is shown to work better than other methods for auto insurance fraud detection specifically. However, this approach is not scalable to large samples and is not appro...

متن کامل

Fast Voltage and Power Flow Contingency Ranking Using Enhanced Radial Basis Function Neural Network

Deregulation of power system in recent years has changed static security assessment to the major concerns for which fast and accurate evaluation methodology is needed. Contingencies related to voltage violations and power line overloading have been responsible for power system collapse. This paper presents an enhanced radial basis function neural network (RBFNN) approach for on-line ranking of ...

متن کامل

Unit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm

Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...

متن کامل

A ranking technique for fast audio identification

We introduce a novel ranking technique for fast and robust audio identification. In this approach, identification is performed by evaluating certain parts of correlation sequences. Starting from a general framework for content-based audio identification, we show how to integrate our new algorithm into a fast index-based search algorithm. We demonstrate the capabilities of our approach by consid...

متن کامل

Very Fast Load Flow Calculation Using Fast-Decoupled Reactive Power Compensation Method for Radial Active Distribution Networks in Smart Grid Environment Based on Zooming Algorithm

Distribution load flow (DLF) calculation is one of the most important tools in distribution networks. DLF tools must be able to perform fast calculations in real-time studies at the presence of distributed generators (DGs) in a smart grid environment even in conditions of change in the network topology. In this paper, a new method for DLF in radial active distribution networks is proposed. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1309.1645  شماره 

صفحات  -

تاریخ انتشار 2013